Partial Evaluation and Efficient Discarding for the Maximal Covering Location Problem
نویسندگان
چکیده
منابع مشابه
Efficient Solution Procedure to Develop Maximal Covering Location Problem Under Uncertainty (Using GA and Simulation)
In this paper, we present the stochastic version of Maximal Covering Location Problem which optimizes both location and allocation decisions, concurrently. It’s assumed that traveling time between customers and distribution centers (DCs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to DC. In classical mod...
متن کاملGeneral form of a cooperative gradual maximal covering location problem
Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...
متن کاملefficient solution procedure to develop maximal covering location problem under uncertainty (using ga and simulation)
in this paper, we present the stochastic version of maximal covering location problem which optimizes both location and allocation decisions, concurrently. it’s assumed that traveling time between customers and distribution centers (dcs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to dc. in classical model...
متن کاملFuzzy Multi-Period Mathematical Programming Model for Maximal Covering Location Problem
In this paper, a model is presented to locate ambulances, considering backup facility (to increase reliability) and the restriction of ambulance capacity. This model is designed for emergencies. In this model the covered demand for each demand point depends on the number of coverage times and the amount of demand. The demand amount and ambulance coverage radius are considered...
متن کاملHybrid heuristics for the probabilistic maximal covering location-allocation problem
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhance its applicability, like the probabilistic model for the maximum covering locationallocation with constraint in waiting time or queue length for congested systems, with one or more servers per service center. This pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: 2169-3536
DOI: 10.1109/access.2021.3055295